Vertex-Decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford Regularity
نویسندگان
چکیده
منابع مشابه
Vertex-decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford Regularity
We call a vertex x of a graph G = (V,E) a codominated vertex if NG[y] ⊆ NG[x] for some vertex y ∈ V \{x}, and a graph G is called codismantlable if either it is an edgeless graph or it contains a codominated vertex x such that G − x is codismantlable. We show that (C4, C5)-free vertex-decomposable graphs are codismantlable, and prove that if G is a (C4, C5, C7)-free well-covered graph, then ver...
متن کاملCohen-macaulay Residual Intersections and Their Castelnuovo-mumford Regularity
In this article we study the structure of residual intersections via constructing a finite complex which is acyclic under some sliding depth conditions on the cycles of the Koszul complex. This complex provides information on an ideal which coincides with the residual intersection in the case of geometric residual intersection; and is closely related to it in general. A new success obtained thr...
متن کاملMultigraded Castelnuovo-mumford Regularity
We develop a multigraded variant of Castelnuovo-Mumford regularity. Motivated by toric geometry, we work with modules over a polynomial ring graded by a finitely generated abelian group. As in the standard graded case, our definition of multigraded regularity involves the vanishing of graded components of local cohomology. We establish the key properties of regularity: its connection with the m...
متن کاملCastelnuovo-mumford Regularity by Approximation
The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given an approximation by modules whose regularities are known. Such approximations can arise naturally for modules constructed by inductive combinatorial means. We apply these methods to bound the regularity of ideals constructed as combinations of linear ideals and the m...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/2387